Summary on Capacity Achieving Probability Measure of an Input-Constrained Vector Gaussian Channels
نویسنده
چکیده
In this summary, the additive Gaussian noise channel subject to two types of constraints: (1) physical channel constraints, and (2) first-order cost constraints is considered. This channel is shown to have a unique capacity achieving input distribution, which is “discrete” in nature. A necessary and sufficient condition for the capacity achieving distribution is also derived. December 22, 2002 DRAFT
منابع مشابه
Capacity Achieving Peak Power Limited Probability Measures: Sufficient Conditions for Finite Discreteness
The problem of capacity achieving (optimal) input probability measure (p.m.) has been widely investigated for several channel models with constrained inputs. So far, no outstanding generalizations have been derived. This paper does a forward step in this direction, by introducing a set of new requirements, for the class of real scalar conditional output p.m.’s, under which the optimal input p.m...
متن کاملGaussian Z Channel with Intersymbol Interference
In this paper, we derive a capacity inner bound for a synchronous Gaussian Z channel with intersymbol interference (ISI) under input power constraints. This is done by converting the original channel model into an n-block memoryless circular Gaussian Z channel (n-CGZC) and successively decomposing the n-block memoryless channel into a series of independent parallel channels in the frequency dom...
متن کاملRandom Matrix Theory and Applications
This summary will briefly describe some recent results in random matrix theory and their applications. 1 Motivation 1.1 Multiple Antenna Gaussian Channels 1.1.1 The deterministic case Consider a gaussian channel with t transmitting and r receiving antennas. The received vector y ∈Cr will depend on the transmitted vector x ∈Ct by y = Hx+n where H is an rxt complex matrix of gains and n is a vect...
متن کاملAchieving Maximum Possible Speed on Constrained Block Transmission Systems
We develop a theoretical framework for achieving the maximum possible speed on constrained digital channels with a finite alphabet. A common inaccuracy that is made when computing the capacity of digital channels is to assume that the inputs and outputs of the channel are analog Gaussian random variables, and then based upon that assumption, invoke the Shannon capacity bound for an additive whi...
متن کاملNon-Asymptotic Analysis of Random Vector Channels
The analysis of large random vector channels, particularly multiple-input-multiple-output (MIMO) channels, has primarily been established in the asymptotic regime, due to the intractability of characterizing the exact distribution of the objective performance metrics. This paper advocates a non-asymptotic approach that often results in more refined estimates on the statistical uncertainty of va...
متن کامل